package com.my.java.algorithm.recursion;

public class Fibonacci {
        public static void main(String[] args) {
                System.out.println(f(3));
        }

        public static int f(int n) {
                if (1 == n || 2 == n)
                        return 1;
                else
                        return f(n - 1) + f(n - 2);
        }
}